#incomplete

References

  1. https://viterbi-web.usc.edu/~shanghua/teaching/Fall2010/lect9.pdf
  2. C. Daskalakis, N. Golowich, and K. Zhang, “The Complexity of Markov Equilibrium in Stochastic Games,” in Proceedings of Thirty Sixth Conference on Learning Theory, G. Neu and L. Rosasco, Eds., in Proceedings of machine learning research, vol. 195. PMLR, July 2023, pp. 4180–4234. [Online]. Available: https://proceedings.mlr.press/v195/daskalakis23a.html
  3. Y. Babichenko, C. Papadimitriou, and A. Rubinstein, “Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash,” Sept. 05, 2025, arXiv: arXiv:1504.02411. doi: 10.48550/arXiv.1504.02411.
  4. A. Deligkas, J. Fearnley, A. Hollender, and T. Melissourgos, “Pure-Circuit: Tight Inapproximability for PPAD,” J. ACM, vol. 71, no. 5, pp. 1–48, Oct. 2024, doi: 10.1145/3678166.